An algorithm for computing certified approximate GCD of n univariate polynomials
نویسندگان
چکیده
منابع مشابه
Displacement Structure in Computing Approximate Gcd of Univariate Polynomials
We propose a fast algorithm for computing approximate GCD of univariate polynomials with coefficients that are given only to a finite accuracy. The algorithm is based on a stabilized version of the generalized Schur algorithm for Sylvester matrix and its embedding. All computations can be done in O(n2) operations, where n is the sum of the degrees of polynomials. The stability of the algorithm ...
متن کاملApproximate Gcd of Inexact Univariate Polynomials
− The problem of finding the greatest common divisor (GCD) of univariate polynomials appears in many engineering fields. Despite its formulation is well-known, it is an ill-posed problem that entails numerous difficulties when the coefficients of the polynomials are not known with total accuracy, as, for example, when they come from measurement data. In this work we propose a novel GCD estimati...
متن کاملComputing Approximate GCD of Univariate Polynomials by Structure Total Least Norm
The problem of approximating the greatest common divisor(GCD) for polynomials with inexact coefficients can be formulated as a low rank approximation problem with Sylvester matrix. This paper presents a method based on Structured Total Least Norm(STLN) for constructing the nearest Sylvester matrix of given lower rank. We present algorithms for computing the nearest GCD and a certified 2-GCD for...
متن کاملApproximate GCD of Multivariate Polynomials
Given two polynomials F and G in R[x1, . . . , xn], we are going to find the nontrivial approximate GCD C and polynomials F , G ∈ R[x1, . . . , xn] such that ||F − CF ′|| < and ||G − CG′|| < , for some and some well defined norm. Many papers 1,2,3,5,8,10,11,13,15 have already discussed the problem in the case n = 1. Few of them 2,10,11 mentioned the case n > 1. Approximate GCD computation of un...
متن کاملAlgorithm for computing μ-bases of univariate polynomials
We present a new algorithm for computing a μ-basis of the syzygy module of n polynomials in one variable over an arbitrary field K. The algorithm is conceptually different from the previously-developed algorithms by Cox, Sederberg, Chen, Zheng, and Wang for n = 3, and by Song and Goldman for an arbitrary n. The algorithm involves computing a “partial” reduced row-echelon form of a (2d+1)×n(d+1)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1999
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(99)00014-6